Bipolar general fuzzy automata

author

  • M. Horry Department of Mathematics Shahid Chamran University of Kerman, Kerman, Iran
Abstract:

In this paper, we define the notion of a bipolar general fuzzy automaton, then we construct some closure operators on the set of states of a bipolar general fuzzy automaton. Also, we construct some topologies on the set of states of a bipolar general fuzzy automaton. Then we obtain some relationships between them.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Irreducibility on General Fuzzy Automata

The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.  

full text

Some (Fuzzy) Topologies on General\ Fuzzy Automata

In this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. In fact, we obtain someLowen-type  and Chang-type fuzzy topologies on general fuzzyautomata. To this end, first we define a Kuratowski fuzzy interioroperator which induces a  Lowen-type  fuzzy topology on the  set ofstates of a max- min general   fuzzy automaton. Also by  provingsome theorems, ...

full text

HYPERGROUPS AND GENERAL FUZZY AUTOMATA

In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...

full text

Transformation of BL-general Fuzzy Automata

In this paper, we prove that any BL-general fuzzy automaton (BL-GFA) and its quotient have the same behavior. In addition, we obtain the minimal quotient BL-GFA and minimal quotient transformation of the BL-GFA, considering the notion of maximal admissible partition. Furthermore, we show that the number of input symbols and time complexity of the minimal quotient transformation of a BL-GFA are ...

full text

Reduction of BL-general L-fuzzy Automata

In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...

full text

Bisimulation for BL-general fuzzy automata

In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 05  issue 02

pages  83- 91

publication date 2016-08-01

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023